Terminal sequences for accessible endofunctors
نویسندگان
چکیده
منابع مشابه
Terminal coalgebras for endofunctors on sets
This paper shows that the main results of Aczel and Mendler on the existence of terminal coalgebras for an endofunctor on the category of sets do not, for the main part of the results require looking at functors on the category of (possibly proper) classes. We will see here that the main results are valid for sets up to some regular cardinal. Should that cardinal be inaccessible, then Aczel and...
متن کاملCoherence for monoidal endofunctors
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal endofunctors, i.e. endofunctors of a monoidal category that preserve the monoidal structure up to a natural transformation that need not be an isomorphism. These results are proved first in the absence of symmetry in the monoidal structure, and then with this symmetry. In the later parts of the p...
متن کاملWeakly Terminal Objects in Quasicategories of SET Endofunctors
The quasicategory Q of all set functors (i.e. endofunctors of the category SET of all sets and mappings) and all natural transformations has a terminal object – the constant functor C1. We construct here the terminal (or at least the smallest weakly terminal object, which is rigid) in some important subquasicategories of Q – in the quasicategory F of faithful connected set functors and all natu...
متن کاملMonads Need Not Be Endofunctors
We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typed λ-calculus syntax and indexed containers. We show that the Kleisli and Eilenberg-Moore constructions carry over to relative monads and are related to relative adjunctions. Under reasonable assumptions...
متن کاملEndofunctors modelling higher-order behaviours
In this paper we show how the abstract behaviours of higherorder systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final coalgebra. Our main contribution is a general construction for defining these functors, solving this circularity which is the essence of higher-order behaviours...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80267-1